General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods
نویسندگان
چکیده
منابع مشابه
General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods
In combinatorics we often meet two kinds of extremal problems. In one kind , optimal configurations consist of 'objects' , which are somehow uniformly spread in the space under consideration ; and in the other kind , optimal configurations consist of 'objects' , which are somehow compressed. To the first kind belong packing , covering and coding problems , whereas diametric (especially of Erdö ...
متن کاملGeneral Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions
The lexicographical order ᏸ on a sequence space ᐄ n ϭ ͕ 0 , 1 ,. .. , ␣ ͖ n , defined by x n Ͻ ᏸ y n if f there exists a t such that x t Ͻ y t and x s ϭ y s for s Ͻ t , is one of the most important and frequently encountered orders in combinatorial extremal theory. An early result in this area , Harper's solution of an edge-isoperimetric problem (EIP) in binary Hamming space ([13]) (generalized i...
متن کاملEdge-Isoperimetric Inequalities and Influences
We give a combinatorial proof of the result of Kahn, Kalai, and Linial [19], which states that every balanced boolean function on the n-dimensional boolean cube has a variable with influence of at least Ω (
متن کاملA General Method to Determine Limiting Optimal Shapes for Edge-Isoperimetric Inequalities
For a general family of graphs on Zn, we translate the edge-isoperimetric problem into a continuous isoperimetric problem in Rn. We then solve the continuous isoperimetric problem using the Brunn-Minkowski inequality and Minkowski’s theorem on mixed volumes. This translation allows us to conclude, under a reasonable assumption about the discrete problem, that the shapes of the optimal sets in t...
متن کاملEdge-isoperimetric inequalities for the symmetric product of graphs
The k-th symmetric product of a graph G with vertex set V with edge set E is a graph G{k} with vertices as k-sets of V , where two k-sets are connected by an edge if and only if their symmetric difference is an edge in E . Using the isoperimetric properties of the vertex-induced subgraphs of G and Sobolev inequalities on graphs, we obtain various edge-isoperimetric inequalities pertaining to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1997
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0105